The vertex connectivity of a {0, 2}-graph equals its degree

Data Security Equals Graph Connectivity

To protect sensitive information in a cross tabulated table, it is a common practice to suppress some of the cells in the table. This paper investigates four levels of data security of a two-dimensional table concerning the effectiveness of this practice. These four levels of data security protect the information contained in, respectively, individual cells, individual rows and columns, several...

The vertex-connectivity of a distance-regular graph

The vertex-connectivity of a distance-regular graph equals its valency. © 2008 Dr Andries E. Brouwer. Published by Elsevier Ltd. All rights reserved.

Vertex Degree of Random Intersection Graph

A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...

The average degree in a vertex-magic graph

The maximum degree in a vertex-magic graph

where E(v) is the set of edges that have v as an end-point. The total labelling λ of G is vertex-magic if every vertex has the same weight, and the graph G is vertexmagic if a vertex-magic total labelling of G exists. Magic labellings of graphs were introduced by Sedlácěk [5] in 1963, and vertex-magic total labellings first appeared in 2002 in [4]. For a dynamic survey of various forms of graph...